A Transport Improvement Problem Transformable to a Best-Path Problem
نویسندگان
چکیده
منابع مشابه
A hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملInterdiction problem as a tool to identify an effective budget allocation to quality improvement plans
In the face of budgetary limitations in organizations, identifying critical facilities for investing in quality improvement plans could be a sensible approach. In this paper, hierarchical facilities with specified covering radius are considered. If disruption happens to a facility, its covering radius will be decreased. For this problem, a bi-objective mathematical formulation is proposed. Crit...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملA DP Approach to Hamiltonian Path Problem
Dynamic Programming hardly requires introduction. Since the term was in introduced by Richard Bellman in 1940’s it has countless applications and it’s power allows to have fast algorithms in cases where at a blush there seems to be no way to avoid exponential time. Such examples include graph algorithms: Bellman-Ford, Floyd-Warshall as well as option pricing, numerical solutions to HJB equation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 1967
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.1.4.295